Constrained numerical optimization of PCR/PLSR predictors
نویسندگان
چکیده
منابع مشابه
Numerical Solution of Implicitly Constrained Optimization Problems ∗
Many applications require the minimization of a smooth function f : R nu → R whose evaluation requires the solution of a system of nonlinear equations. This system represents a numerical simulation that must be run to evaluate f. This system of nonlinear equations is referred to as an implicit constraint. In principle f can be minimized using the steepest descent method or Newton-type methods f...
متن کاملsolution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
Numerical Solution for PDE-Constrained Optimization Problem in Cardiac Electrophysiology
In this paper, we present the numerical solution for the PDE-constrained optimization problem arises in cardiac electrophysiology. The monodomain model, which is a well-established model for simulating electrical behavior of the cardiac tissue, appears as the constraint in our problem. Our objective is to search for the optimal applied current, which is able to dampen out the excitation wavefro...
متن کاملA Particle Swarm Optimizer for Constrained Numerical Optimization
This paper presents a particle swarm optimizer to solve constrained optimization problems. The proposed approach adopts a simple method to handle constraints of any type (linear, nonlinear, equality and inequality), and it also presents a novel mechanism to update the velocity and position of each particle. The approach is validated using standard test functions reported in the specialized lite...
متن کاملImproved Particle Swarm Optimization in Constrained Numerical Search Spaces
This chapter presents a study about the behavior of Particle Swarm Optimization (PSO) in constrained search spaces. A comparison of four well-known PSO variants used to solve a set of test problems is presented. Based on the information obtained, the most competitive PSO variant is detected. From this preliminary analysis, the performance of this variant is improved with two simple modification...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chemometrics and Intelligent Laboratory Systems
سال: 2003
ISSN: 0169-7439
DOI: 10.1016/s0169-7439(02)00159-4